Gray code for derangements
نویسندگان
چکیده
We give a Gray code and constant average time generating algorithm for derangements, i.e., permutations with no 0xed points. In our Gray code, each derangement is transformed into its successor either via one or two transpositions or a rotation of three elements. We generalize these results to permutations with number of 0xed points bounded between two constants. ? 2003 Elsevier B.V. All rights reserved.
منابع مشابه
Gray Images of Constacyclic Codes over some Polynomial Residue Rings
Let be the quotient ring where is the finite field of size and is a positive integer. A Gray map of length over is a special map from to ( . The Gray map is said to be a ( )-Gray map if the image of any -constacyclic code over is a -constacyclic code over the field . In this paper we investigate the existence of ( )-Gray maps over . In this direction, we find an equivalent ...
متن کاملUse of gray wolf algorithm to optimize gas microturbineUse of gray wolf algorithm to optimize gas microturbine
In this research, optimization of gas microturbine through economic, exergy and environmental analysis has been investigated by the gray wolf algorithm. First, a thermodynamic modeling was performed for each of the above modes, and then using the gray wolf method, optimum points were determined for each systemchr('39')s performance. For modeling, the code written in MATLAB software was used. ...
متن کاملThe Gray Code
Here we summarise the properties and algorithms of the Gray code. Descriptions are given of the Gray code definition, algorithms and circuits for generating the code and for conversion between binary and Gray code, for incrementing, counting, and adding Gray code words. Some interesting applications of the code are also treated. Java implementations of the algorithms in this paper are available...
متن کاملLogic for Gray Code Computation
Gray code is a well-known binary number system such that neighboring values differ in one digit only. Tsuiki (2002) has introduced Gray code to the field of real number computation. He assigns to each number a unique 1⊥-sequence, i.e., a (possibly infinite) sequence of {−1, 1,⊥} such that at most one copy of ⊥ (meaning undefinedness) is contained in the sequence not as the last character. In th...
متن کاملLow Complexity Reconfigurable Variable WALSH Code for Multi Standard Wireless Front End Receivers
The low-complexity reconfigurable Variable Walsh Code tree (VWCT) for wireless communication applications such as spectrum sensing and channelization. In VWCT, the bandwidth and center frequency of sub-bands can be varied with high frequency resolution without hardware reimplementation. The proposed a simple technique to construct Walsh code sets of any length recursively using 4-bit Gray and I...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Applied Mathematics
دوره 140 شماره
صفحات -
تاریخ انتشار 2004